Rank 2 Affine Mv Polytopes
نویسندگان
چکیده
We give a realization of the crystal B(−∞) for ̂ sl2 using decorated polygons. The construction and proof are combinatorial, making use of Kashiwara and Saito’s characterization of B(−∞), in terms of the ∗ involution. The polygons we use have combinatorial properties suggesting they are the ̂ sl2 analogues of the Mirković-Vilonen polytopes defined by Anderson and the third author in finite type. Using Kashiwara’s similarity of crystals we also give MV polytopes for A (2) 2 , the other rank 2 affine Kac-Moody algebra.
منابع مشابه
Mirkovic-vilonen Cycles and Polytopes
We give an explicit description of the Mirkovic-Vilonen cycles on the affine Grassmannian for arbitrary reductive groups. We also give a combinatorial characterization of the MV polytopes. We prove that a polytope is an MV polytope if and only if every 2-face of it is a rank 2 MV polytope.
متن کاملMv-polytopes via Affine Buildings
For an algebraic group G, Anderson originally defined the notion of MV-polytopes in [And03], images of MV-cycles, defined in [MV07], under the moment map of the corresponding affine Grassmannian. It was shown by Kamnitzer in [Kam07] and [Kam05] that these polytopes can be described via tropical relations and give rise to a crystal structure on the set of MV-cycles. Another crystal structure can...
متن کاملThe Crystal Structure on the Set of Mirković-vilonen Polytopes
In an earlier work, we proved that MV polytopes parameterize both Lusztig’s canonical basis and the Mirković-Vilonen cycles on the Affine Grassmannian. Each of these sets has a crystal structure (due to Kashiwara-Lusztig on the canonical basis side and due to Braverman-Finkelberg-Gaitsgory on the MV cycles side). We show that these two crystal structures agree. As an application, we consider a ...
متن کاملPolytopes of Minimum Positive Semidefinite Rank
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k × k real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a polytope is at least the dimension of the polytope plus one, and we characterize those polytopes whose psd rank equals this lower bound.
متن کاملHow to compute the rank of a Delaunay polytope
Roughly speaking, the rank of a Delaunay polytope (first introduced in [2]) is its number of degrees of freedom. In [3], a method for computing the rank of a Delaunay polytope P using the hypermetrics related to P is given. Here a simpler more efficient method, which uses affine dependencies instead of hypermetrics is given. This method is applied to classical Delaunay polytopes. Then, we give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013